Towards A Certified Peer-to-Peer Lookup System
نویسنده
چکیده
Implementing peer-to-peer systems correctly is difficult due to the extreme situations under which these systems are designed to operate. Unlike in other types of distributed systems, in peer-to-peer systems, arbitrary machines can participate in the system, and machines can leave and join the network at any time. This distinction makes it challenging to formally reason about these types of systems. In order to better understand how to design and implement certified P2P systems supporting dynamic membership, we work towards verifying a peer-to-peer lookup system.
منابع مشابه
TAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملApproximate Range Selection Queries in Peer-to-Peer Systems
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactmatch data objects to simple user queries. Since peer-to-peer users generally tend to submit broad queries in order to find data of their interest, we develop a P2P data sharing architecture for computing approximate an...
متن کاملImproved Lookup Algorithms for Viceroy
We present a new lookup algorithm for Viceroy, a peer-to-peer system, which outperforms the existing algorithm for the system, yet it is much simpler and easier to implement. We also present our fully-functional graphical simulation of Viceroy, and propose several other improved lookup (routing) algorithms for this network. We show experimental results to support our claims, and discuss the imp...
متن کاملLookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling the basic trade-off between forwarding queries among peers and maintaining lookup tables in peers, so that we can utilize optimized lookup table scale to minimize bandwidth consumption, and to greatly improve the searc...
متن کاملPeer-to-Peer Overlay Network Management through AGILE
Currently, state of the art peer-to-peer (P2P) lookup mechanisms actively create and manage a peer application layer overlay network to achieve scalability and efficiency. The proposed mechanism AGILE (Adaptive, Group-of-Interest-based Lookup Engine) extends this management approach, adapting the overlay network such as to bring requesting peers and desired lookup items close together, reducing...
متن کامل